-
1 graph (-theory) problem
Робототехника: задача теории графовУниверсальный англо-русский словарь > graph (-theory) problem
-
2 graph-theory problem
Программирование: задача теории графов -
3 graph-theory problem
Англо-русский словарь по робототехнике > graph-theory problem
-
4 graph theory
-
5 graph theory
мат. теория графов (раздел конечной математики, особенностью которого является геометрический подход к изучению объектов)See: -
6 graph
график, диаграмма, кривая, граф
– graph model
– graph path
– graph problem
– graph representation
– graph search
– graph structure
– graph theory
– graph vertex
– graph-search algorithm
– graph-theory problem
-
7 problem
задача; проблема- accounting problem
- allocation problem
- assignment problem
- ballot problem
- benchmark problem
- blending problem
- bottleneck problem
- boundary-value problem
- boundary problem
- business problem
- Byzantine Generals problem
- center problem
- check problem
- chess problem
- commonly encountered problem
- computational problem
- continuum problem
- covering problem
- data problem
- data-set problem
- daunting problem
- decision problem
- deducibility problem
- design problem
- dining philosophers' problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- estimation problem
- EVA problem
- extremely ill-conditioned problem
- fault-location problem
- filtering problem
- findpath problem
- finger-pointing problem
- flow problem
- frame problem
- free-boundary problem
- game-theory problem
- game problem
- graph theoretic problem
- graphics problem
- ill-conditioned problem
- ill-defined problem
- ill-posed problem
- inference problem
- information retrieval problem
- initial value problem
- intractable problem
- job-shop problem
- knapsack problem
- Konigsberg bridge problem
- labyrinth problem
- location problem
- logical problem
- management problem
- market analysis problem
- marriage problem
- maximum flow problem
- maximum network flow problem
- mildly ill-posed problem
- minimal connector problem
- model problem
- multivariate problem
- newspaper-boy problem
- ninety percent complete problem
- nominal design problem
- off-by-one problem
- omelet problem
- one-sample problem
- postman problem
- programming problem
- projection problem
- pursuit problem
- quadratic assignment problem
- queuing problem
- race problem
- ramification problem
- real-time problem
- real-world problem
- reducibility problem
- resource allocation problem
- routing problem
- ruin problem
- satisfiability problem
- scheduling problem
- search problem
- severely ill-posed problem
- shortest route problem
- simulated problem
- software problem
- sparse problem
- stale data problem
- stochastic problem
- switchbox routing problem
- switchbox problem
- target assignment problem
- test problem
- three-dimensional problem
- time transportation problem
- trade-off problem
- traffic problem
- transport problem
- transportation problem
- traveling salesman problem
- trouble-location problem
- troubleshooting problem
- unconstrained problem
- undecidable problem
- underdetermined problem
- unsolvable problem
- unstructured problem
- variational problem
- vessel loading problem
- waiting line problem
- weak bridge problem
- well-behaved problem
- well-defined problem
- well-posed problemEnglish-Russian dictionary of computer science and programming > problem
-
8 graph problem
1) Робототехника: (-theory) задача теории графов2) Макаров: задача на графах, задача теории графов -
9 Chinese postman's problem
т. граф. задача китайского почтальона (задача нахождения цикла, проходящего через каждое ребро графа по крайней мере один раз и имеющего минимальную суммарную длину)See:Англо-русский экономический словарь > Chinese postman's problem
-
10 Koenigsberg's bridges problem
т. граф. задача о кенигсбергских мостах (задача обхода всех семи мостов города таким образом, чтобы каждый мост был пройден в точности один раз; задача была поставлена и решена в 1736 г.)See:Англо-русский экономический словарь > Koenigsberg's bridges problem
-
11 marriage problem
1) общ. проблема брака, проблема в браке, семейная проблема, трудность в браке2) т. граф. задача о свадьбах (заключается в определении условий, при которых юноши могут жениться таким образом, чтобы каждый женился на знакомой ему девушке, если задано некоторое количество юношей и девушек и каждый юноша знаком только с несколькими девушками)See:
См. также в других словарях:
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices … Wikipedia
Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue … Wikipedia
Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… … Wikipedia
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Degree (graph theory) — A graph with vertices labeled by degree In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.[1] The degree of a vertex … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… … Wikipedia